Checking Integrity Constraints in Deductive Systems based on Production Rules and a Description Logic Terminology
نویسندگان
چکیده
The aim of this paper is to show a method that is able to detect a particular class of semantic inconsistencies in a deductive system (DS). A DS verified by this method contains a set of first order production rules, and a description logic terminology that defines the domain problem. By building an ATMS-like theory the method is able to give an specification of all the initial Fact Bases (FBs), and the rules that would have to be executed from these initial FBs to produce an inconsistency.
منابع مشابه
Deductive Database Systems and integrity constraint checking
Today, relational database systems have been extended in several ways. One way to extend the relational database model is by adding rules. These rules can make a lot of information implicit. In other words, a lot of intensional facts Sle stored in the database through rules. Consequently, when one updates such a database, a lot of implicit updates may appear by the presence of rules. When also ...
متن کاملIntegrity Constraints in Logic Databases
D We consider logic databases as logic programs and suggest how to deal with the problem of integrity constraint checking. Two methods for integrity constraint handling are presented. The first one is based on a metalevel consistency proof and is particularly suitable for an existing database which has to be checked for some integrity constraints. The second method is based on a transformation ...
متن کاملApplying Transition Rules to Bitemporal Deductive Databases for Integrity Constraint Checking
A bitemporal deductive database is a deductive database that supports valid and transaction time. A set of facts to be inserted and/or deleted in a bitemporal deductive database can be done in a past, present or future valid time. This circumstance causes that the maintenance of database consistency becomes more hard. In this paper, we present a new approach to reduce the difficulty of this pro...
متن کاملClassification and Specification of Update Problems*
Deductive databases are based on deductive rules (views) which define the common knowledge shared by different users by allowing to deduce new facts (derived or view facts) from base facts explicitly stored in the database. Deductive databases use logic programming as a base language and generalize relational databases by overcoming the limitations of relational languages in the definition of c...
متن کاملFurther Improvement on Integrity Constraint Checking for Stratifiable Deductive Databases
Integrity constraint checking for stratifiable deductive databases has been studied by many authors. However, most of these methods may perform unnecessary checking if the update is irrelevant to the constraints. [Lee94] proposed a set called relevant set which can be incorporated in these works to reduce unnecessary checking. [Lee94] adopts a top-down approach and makes use of constants and ev...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004